A Sequent Calculus for Bilattice-Based Logic and Its Many-Sorted Representation
نویسنده
چکیده
We introduce a sequent calculus for bilattice-based annotated logic (BAL). We show that this logic can be syntactically and semantically translated into a fragment MSL∗ of conventional many-sorted logic MSL. We show deductive equivalence of sequent calculus for BAL and sequent calculus for MSL∗.
منابع مشابه
The logic of distributive bilattices
Bilattices, introduced by Ginsberg [26] as a uniform framework for inference in Artificial Intelligence, are algebraic structures that proved useful in many fields. In recent years, Arieli and Avron [3] developed a logical system based on a class of bilattice-based matrices, called logical bilattices, and provided a Gentzen-style calculus for it. This logic is essentially an expansion of the we...
متن کاملOntological Knowledge Base Reasoning with Sort-Hierarchy and Rigidity
Although sorts and unary predicates are semantically identical in order-sorted logic, they are classified as different kinds of properties in formal ontology (e.g. sortal and non-sortal). This ontological analysis is an essential notion to deal with properties (or sorts) of objects in knowledge representation and reasoning. In this paper, we propose an extension of an order-sorted logic with th...
متن کاملFocused Linear Logic and the λ-calculus
Linear logic enjoys strong symmetries inherited from classical logic while providing a constructive framework comparable to intuitionistic logic. However, the computational interpretation of sequent calculus presentations of linear logic remains problematic, mostly because of the many rule permutations allowed in the sequent calculus. We address this problem by providing a simple interpretation...
متن کاملCombining Order-Sorted Logic Programming with Formal Ontology
In formal ontology, entity types and relationships are philosophically defined, and the properties of objects are classified on the basis of sortality, rigidity, and identity (called property classification). Sorts and unary predicates are semantically identical in order-sorted logic, but they are respectively sortal and non-sortal (i.e., they are distinguished) in a formal ontology. This ontol...
متن کاملA Sequent Based Theorem Prover for Propositional Intuitionistic Logic
We describe a theorem prover based on a new sequent calculus for Intuitionistic Propositional Logic. We discuss the effects of various optimisations, and analyse its performance compared to current state of the art theorem provers. We find that the prover produces competitive results on many classes of formulae.
متن کامل